Decomposition Problems in Computational Geometry
نویسنده
چکیده
v
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملComputational Geometry and Computer Graphics
Computer graphics is a defining application for computational geometry. The interaction between these fields is explored through two scenarios. Spatial subdivisions studied from the viewpoint of computational geometry are shown to have found application in computer graphics. Hidden surface removal problems of computer graphics have led to sweepline and area subdivision algorithms in computation...
متن کاملDiscrete Geometry and Computational Representation Theory: A Research Statement
The question whether P 6= NP is widely regarded to be one of the most important outstanding problems in modern mathematics [39]. I work in an emerging intersection of three areas of mathematics which recent developments suggest may provide new test cases and perhaps new insight into this problem. These three areas are computational representation theory, polyhedral geometry, and theoretical com...
متن کاملSolving piecewise polynomial constraint systems with decomposition and a subdivision-based solver
Boris van Sosin Computer Science Department, Technion-Israel Institute of Technology Solving Piecewise Polynomial Constraint Systems with Decomposition using Subdivision-Based Solver Piecewise polynomial constraint systems are common in numerous problems in computational geometry, such as constraint programming, modeling, and kinematics. In this talk, we present a framework that is capable of ...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992